Priorities for Modeling and Verifying Distributed Systems

نویسندگان

  • Rance Cleaveland
  • Gerald Lüttgen
  • V. Natarajan
  • Steve Sims
چکیده

This paper illustrates the use of priorities in process algebras by a real-world example dealing with the design of a safety-critical network which is part of a railway signaling system. Priorities in process algebras support an intuitive modeling of distributed systems since undesired interleavings can be suppressed. This fact also leads to a substantial reduction of the sizes of models. We have implemented a CCS-based process algebra with priorities as a new front-end for the NCSU Concurrency Workbench, and we use model checking for verifying properties of the signaling system.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modeling and Verifying Distributed Systems Using Priorities: a Case Study Modeling and Verifying Distributed Systems Using Priorities 1

This paper illustrates the use of priorities in process algebras by a real-world example dealing with the design of a safety-critical network which is part of a railway signaling system. Priorities in process algebras support an intuitive modeling of distributed systems since undesired inter-leavings can be suppressed. This fact also leads to a substantial reduction of the sizes of models. We h...

متن کامل

Modeling and Verifying Distributed Systems Using Priorities: A Case Study

This paper illustrates the use of priorities in process algebras by a real-world example dealing with the design of a safety-critical network that is part of a railway signaling system. Priorities in process algebras support an intuitive modeling of distributed systems since undesired interleavings can be suppressed. This fact also leads to a substantial reduction of the sizes of models. We hav...

متن کامل

Dynamic Priorities for Modeling Real-Time

This paper describes an approach for modeling real-time systems using dynamic priorities. The advantage of the technique is that it drastically reduces the state space sizes of the systems in question while preserving properties of their functional behavior. We demonstrate the utility of our approach by formally modeling and verifying aspects of the widely-used SCSI-2 bus-protocol. It turns out...

متن کامل

A Formal Specification Framework for Designing and Verifying Reliable and Dependable Software for CNC Systems

As a distributed computing system, a CNC system needs to be operated reliably, dependably, and safely. How to design reliable and dependable software and perform effective verification for CNC systems becomes an important research problem. In this paper, we propose a new modeling method called TTM/ATRTTL (timed transition models/all-time real-time temporal logics) for specifying CNC systems. TT...

متن کامل

An Algebraic Theory of Distributed Real-Time

This paper develops a real-time process algebra, TPLmc, for modeling and reasoning about distributed real-time systems. Like the algebra PMC, TPLmc includes operators for binding processes to di erent clocks; unlike PMC, however, TPLmc includes a version of the maximal progress assumption. Using simple examples, we motivate why these features are useful and in some cases necessary for modeling ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996